An Infinitesimal Perturbation Analysis Algorithm for a Multiclass G/G/1 Queue*
نویسندگان
چکیده
It has been shown that infinitesimal perturbation analysis (IPA) provides very efficient algorithms for estimating derivatives in a broad class of discrete event dynamic systems (DEDS). But in its simple form, it fails in most multiclass DEDS. In this paper, we propose a revised IPA for a multiclass G/G/1 queue.
منابع مشابه
Convergence of a Stochastic Approximation Algorithm for the GI/G/1 Queue Using Infinitesimal Perturbation Analysis
Discrete-event systems to which the technique of infinitesimal perturbation analysis (IPA) is applicable are natural candidates for optimization via a Robbins-Monro type stochastic approximation algorithm. We establish a simple framework for single-run optimization of systems with regenerative structure. The main idea is to convert the original problem into one in which unbiased estimators can ...
متن کاملMaximum Entropy Analysis for G/G/1 Queuing System (TECHNICAL NOTE)
This paper provides steady state queue-size distribution for a G/G/1 queue by using principle of maximum entropy. For this purpose we have used average queue length and normalizing condition as constraints to derive queue-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arr...
متن کاملOn the non-Markovian multiclass queue under risk-sensitive cost
This paper studies a control problem for the multiclass G/G/1 queue for a risk-sensitive cost of the form n logE exp ∑ i ciX n i (T ), where ci > 0 and T > 0 are constants, X n i denotes the class-i queue length process, and the number of arrivals and service completions per unit time are of order n. The main result is the asymptotic optimality, as n → ∞, of a priority policy, provided that ci ...
متن کاملAn Asymptotic Optimality Result for the Multiclass Queue with Finite Buffers in Heavy
For a multiclass G/G/1 queue with finite buffers, admission and scheduling control, and holding and rejection costs, we construct a policy that is asymptotically optimal in the heavy traffic limit. The policy is specified in terms of a single parameter which constitutes the free boundary point from the Harrison-Taksar free boundary problem, but otherwise depends explicitly on the problem data. ...
متن کاملA Perturbation Analysis Approach to Phantom Estimators for Waiting Times in the G/G/1 Queue
We study gradient estimation for waiting times in the G/G/1 queue. We propose a new estimator based on a synthesis of perturbation analysis and weak differentiation. More specifically, we combine the perturbation propagation rules from perturbation analysis with perturbation generation rules from weak differentiation. This leads to an on-line phantom estimator. Numerical experiments show that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1987